Transportation networks with random arc capacities
نویسندگان
چکیده
منابع مشابه
Flows in dynamic networks with aggregate arc capacities
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic flow problems, called bridge problem. The bridge problem has practical importance and raises interesting theoretical issues. We show that the bridge problem is NP-complete. Traditional static flow techniques for solving dy...
متن کاملAn Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
We consider the class of multistage dynamic networks with random arc capacities, a framework that is well suited to model dynamic eet management problems. We propose a successive convex approximation approach that produces an approximation to the expected recourse function which captures the future e ects of current decisions under uncertainty. This method decomposes the network in each stage i...
متن کاملFuzzy Transportation Problem with Random Transportation Costs
We consider the following transportation problem with both random and fuzzy factors. There exist m supply points and n demand points. For each route between supply point and demand point, unit transportation cost is a random variable according to a normal distribution and existence possibility denoting the preference choosing this route is attached. The probability that the total transportation...
متن کاملOptimal Resource Allocation in Random Networks with Transportation Bandwidths
We apply statistical physics to study the task of resource allocation in random sparse networks with limited bandwidths for the transportation of resources along the links. Recursive relations from the Bethe approximation are converted into useful algorithms. Bottlenecks emerge when the bandwidths are small, causing an increase in the fraction of idle links. For a given total bandwidth per node...
متن کاملSelf-organized Balanced Resources in Random Networks with Transportation Bandwidths
We apply statistical physics to study the task of resource allocation in random networks with limited bandwidths for the transportation of resources along the links. We derive algorithms which searches the optimal solution without the need of a global optimizer. For networks with uniformly high connectivity, the resource shortage of a node becomes a well-defined function of its capacity. An eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle
سال: 1972
ISSN: 0397-9350
DOI: 10.1051/ro/197206v300451